Analysis of elastodynamic problems by a multiple integral transform method using a fast Fourier transform. (1st Report, Basic investigation).
نویسندگان
چکیده
منابع مشابه
Using a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملEngineering a Fast Fourier Transform
Computing the discrete Fourier transform is one of the most important in applied computer science, with applications in fields as diverse as seismology, signal analysis, and various branches of engineering. A great many algorithms exist for quickly computing different variations of the transform – fast Fourier transforms, or FFTs. Because of their practical importance, even small improvements t...
متن کاملVibration analysis of a rotating closed section composite Timoshenko beam by using differential transform method
This study introduces the Differential Transform Method (DTM) in the analysis of the free vibration response of a rotating closed section composite, Timoshenko beam, which features material coupling between flapwise bending and torsional vibrations due to ply orientation. The governing differential equations of motion are derived using Hamilton’s principle and solved by applying DTM. The natura...
متن کاملVery fast discrete Fourier transform, using number theoretic transform
It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...
متن کاملWavelet transform based fast approximate Fourier transform
We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coe cients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A
سال: 1989
ISSN: 0387-5008,1884-8338
DOI: 10.1299/kikaia.55.2271